Symmetric Rank-k Update on Clusters of Multicore Processors with SMPSs

نویسندگان

  • Rosa M. Badia
  • Jesús Labarta
  • Vladimir Marjanovic
  • Alberto F. Martín
  • Rafael Mayo
  • Enrique S. Quintana-Ortí
  • Ruymán Reyes
چکیده

We investigate the use of the SMPSs programming model to leverage task parallelism in the execution of a message-passing implementation of the symmetric rank-k update on clusters equipped with multicore processors. Our experience shows that the major difficulties to adapt the code to the MPI/SMPSs instance of this programming model are due to the usage of the conventional column-major layout of matrices in numerical libraries. On the other hand, the experimental results show a considerable increase in the performance and scalability of our solution when compared with the standard options based on the use of a pure MPI approach or a hybrid one that combines MPI/multi-threaded BLAS.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Leveraging task-parallelism in message-passing dense matrix factorizations using SMPSs

In this paper, we investigate how to exploit task-parallelism during the execution of the Cholesky factorization on clusters of multicore processors with the SMPSs programming model. Our analysis reveals that the major difficulties in adapting the code for this operation in ScaLAPACK to SMPSs lie in algorithmic restrictions and the semantics of the SMPSs programming model, but also that they bo...

متن کامل

A Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints

One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...

متن کامل

Hybrid Message-Passing and Shared-Memory Programming in a Molecular Dynamics Application On Multicore Clusters

Hybrid programming, whereby shared memory and message passing programming techniques are combined within a single parallel application, has often been discussed as a method for increasing code performance on clusters of symmetric multiprocessors (SMPs). This paper examines whether the hybrid model brings any performance benefits for clusters based on multicore processors. A molecular dynamics a...

متن کامل

First Workshop on Programmability Issues for Multi-Core Computers (MULTIPROG-1)

We are certainly approaching the construction of very powerful supercomputers based on large multicore chips and approaching counts of millions of cores. Is the situation very different from the description in the book of Genesis of the attempt to build the Tower of Babel and the confusion of tongues? How to program such machines is certainly one of the most challenging issues for the immediate...

متن کامل

Analyzing Performance Asymmetric Multicore Processors for Latency Sensitive Datacenter Applications

The semiconductor industry is continuing to harness performance gains through Moore’s Law by developing multicore chips. While thus far these architectures have incorporated symmetric computational components, asymmetric multicore processors (AMPs) have been proposed as a possible alternative to improve power efficiency. To quantify the tradeoffs and benefits of these designs, in this paper we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011